GLISP: A Lisp-Based Programming System with Data Abstraction

GLISI’ is a high-level language that. is compiled into LISP It provides a versatile abst~art,-dnt.a-t.ypc facility with hierarchical inheritance of pl oprl ties and object,-centered programming GLISP programs are shorter and more readable than equivalent LISP programs The object code produced by GLISP is optimized, making it about as cfflcient as handwritten LISP An integrated programming environment is provided, including automatic incremental compilation, interpretive programming features, and an intelligent display-hased inspector/editor for data and data-type descriptions GLISP code is relatively portahlr; the compiler and the data inspcrtor are implemcntcd for most major dialects of LISI’ and arc availablr flee or at nominal cost GI,ISP (NOVAK 1982, 1983A, 1983B) is a high-level language, based on LISP and including LISP as a sublanguage, that is compiled into LISP (which can be further compiled t,o machine language by the LISP compiler). The GLISP system runs within an existing LISP system and provides a.11 intrgratcd programming environment, that includes automatic incremental compilation of GLISP programs, interactive execution and debugging, and display-based editing and inspecThis research was supported in part by NSF grant SED-7912803 in the Joint National Science Foundation National Institute of Education Program of Research on Cognitive Processes and the Struct,urr of Knowledge in Science and Mathematics, and in part by the Defense Advanced Resealrh Projects Agency rmdel contract MDA-903-80-c-007 Author’s present address: Computer Science Department, University of Texas at Austin, Austin, TX: 78712 tion of data. IJse of GLISP makes writing, debugging, and modifying programs significantly easier; at the same time, the code produced by the compiler is optimized so that, it,s execution efficiency is comparable to that of handwritten LISP This article describes features of GLISP and illustrates them with examples Most of the syntax of GI,ISI’ is similar to LISP syntax or PASCAL synt,ax, so explicit. treatment of GLISP syntax will be brief. GLISP programs are compiled rclativc to a knowleflgc hasc of ohjcct, descriptions, a form of abstract. data types (Liskov et al. 1977; Wulf, London, ,Q Shaw 1976). A primary goal of the USC of abstract data types in GLISP is to make programming easier The ifnplerrient.:tt,iolis of’ objects are described in a single place; the compiler uses t,hc object. descriptions to convert GLISP code written in terms of user objects into efficient 1,TSP code writt,en in terms of the implcment,ations of the oqjects in LISP This allows the implcmentations of ol?jects to hc changed without, changing the code; it also allows the same code t.o be cffect,ivc for ol?ject.s that arc implemented in diffcrcnt, ways and thereby allows the accumulation of programming knowledge in the form of generic programs Figure 1 illustrates the combination of information from these t,hree sources; the recursive use of abstract, data types and generic programs in the coinpilation process provides multiplicative power for describing programs Overall, GLISP progranl syntax is like t,hat, of I,lSI’ THE AI MAGAZINE Fall 1983 37 AI Magazine Volume 4 Number 3 (1983) (© AAAI)